8. Selected DHT Algorithms
نویسندگان
چکیده
Several different approaches to realizing the basic principles of DHTs have emerged over the last few years. Although they rely on the same fundamental idea, there is a large diversity of methods for both organizing the identifier space and performing routing. The particular properties of each approach can thus be exploited by specific application scenarios and requirements. This overview focuses on the three DHT systems that have received the most attention in the research community: Chord, Pastry, and Content Addressable Networks (CAN). Furthermore, the systems Symphony, Viceroy, and Kademlia are discussed because they exhibit interesting mechanisms and properties beyond those of the first three systems.
منابع مشابه
New high-speed prime-factor algorithm for discrete Hartley transform - Radar and Signal Processing, IEE Proceedings F
Fast algorithms for computing the DHT of short transform lengths (N = 2, 3, 4, 5, 7, 8, 9 and 16) are derived. A new prime-factor algorithm is also proposed to compute the long-length DHTs from the short-length DHT algorithms. The short-length algorithms (except for N = 8 and N = 16) are such that the even and the odd parts of the DHT components are obtained directly, without any additional com...
متن کاملReducing Maintenance Overhead in DHT Based Peer-to-Peer Algorithms
DHT based Peer-to-Peer (P2P) algorithms are very promising for their efficient routing performance. However, most commercial P2P systems donot adapt DHT algorithms and still use central facilities or broadcasting based routing mechanisms. One reason impeding the DHT algorithm popularity is the routing information maintenance overhead in DHT algorithms, it generates considerable network traffic ...
متن کاملSurvey of DHT Evaluation Methods
In this paper, we present an overview of factors affecting the performance of the DHT-algorithms and give examples of how these factors have been measured from the DHT algorithms. We analyse the strengths and weaknesses of evaluation methods that are based on simulation, and make observations on the growing importance of globally distributed testbeds such as PlanetLab. We conclude that the best...
متن کاملIn-place in-order mixed radix fast Hartley transforms
This paper presents two Fortran programs that calculate the mixed radix discrete Hartley transform (DHT) using a general odd length p-point DHT module and several short length Winograd DHT (WDHT) modules. Each program has its own advantages such as simplicity for implementation or minimum arithmetic complexity. New efficient radix-3, odd radix-p FHT algorithms and short WDHT modules have been d...
متن کاملEvaluating DHT Implementations in Complex Environments by Network Emulator
We propose an evaluation method of large-scale distributed hash tables by network emulator that allows us to evaluate not only DHT algorithms but also DHT implementations. Evaluating DHT implementations is important for DHT application developers since it influences how an application utilizes a DHT. We built a platform to support our method and evaluated four implementations with various scena...
متن کامل